Complexity Classes Characterized by Semi-Random Sources
نویسنده
چکیده
The complexity classes characterized by semirandom sources were investigated. U.V. Vazirani and V.V Vazirani [VV85] showed that 8 -RP = RP, and U.V. Vazirani [Vaz86] showed that 8 -BPP = BPP, where, for the random class C, the class 8 -C is a set of all languages which satisfy the condition for C by using any -random source. First, we show
منابع مشابه
Title: Complexity Classes Characterized by Semi-random Sources
The complexity classes PP;BPP and RP are usually de ned via probabilistic Turing machines (PTMs) that have access to a perfect random source. A natural question is this: Do these classes change if the PTMs only have access to an arbitrary semi-random source rather than a perfect random source? The notion of semi-randomness are de ned by Satha and Vazirani in 1984, and this question was rst cons...
متن کاملAre chaotic systems dynamically random ?
Physical systems can be characterized by several types of complexity measures which indicate the computational resources employed. With respect to these measures, several chaos classes may be distinguished. There exists a constructive approach to random physical motion which operates with computable initial values and deterministic evolution laws. For certain limits, these chaos classes render ...
متن کاملMinimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
We present new algorithms for k-coloring and minimum (x(G)-) coloring random and semi-random kcolorable graphs in polynomial expected time. The random graphs are drawn from the G(n,p, k) model and the semi-random graphs are drawn from the G s ~ ( n , p , k) model. In both models, an adversary initially splits the n vertices into IC color classes, each of size @(n). Then the edges between vertic...
متن کاملRandomness and non-uniformity
In the first part, we introduce randomized algorithms as a new notion of efficient algorithms for decision problems. We classify randomized algorithms according to their error probabilities, and define appropriate complexity classes. (RP, coRP, ZPP, BPP, PP). We discuss which classes are realistic proposals for design of probabilistic algorithms. We cover the implementation of randomized algori...
متن کاملWeakly-Supervised Acquisition of Labeled Class Instances using Graph Random Walks
We present a graph-based semi-supervised label propagation algorithm for acquiring opendomain labeled classes and their instances from a combination of unstructured and structured text sources. This acquisition method significantly improves coverage compared to a previous set of labeled classes and instances derived from free text, while achieving comparable precision.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995